Parameterized complexity of k-anonymity: hardness and tractability
نویسندگان
چکیده
منابع مشابه
Parameterized Complexity of k-Anonymity: Hardness and Tractability
The problem of publishing personal data without giving up privacy is becoming increasingly important. A clean formalization that has been recently proposed is the k-anonymity, where the rows of a table are partitioned in clusters of size at least k and all rows in a cluster become the same tuple, after the suppression of some entries. The natural optimization problem, where the goal is to minim...
متن کاملCharacterizing Hardness in Parameterized Complexity
Parameterized complexity theory relaxes the classical notion of tractability and allows to solve some classically hard problems in a reasonably efficient way. However, many problems of interest remain intractable in the context of parameterized complexity. A completeness theory to categorize such problems has been developed based on problems on circuits and Model Checking problems. Although a b...
متن کاملRainbow Connectivity: Hardness and Tractability
A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists a (geodesic) rainbow path between every pair of vertices. The (strong) rainbow connectivity of a graph G, denoted by (src(G), respectively) rc(G) is the smallest number of colors required to edge color the graph such ...
متن کاملAdvice Classes of Parameterized Tractability
Many natural computational problems have input consisting of two or more parts, one of which may be considered a parameter. For example, there are many problems for which the input consists of a graph and a positive integer. A number of results are presented concerning parameterized problems that can be solved (uniformly with respect to the parameter) in complexity classes below P , given a sin...
متن کاملParameterized complexity of k-Chinese Postman Problem
We consider the following problem called the k-Chinese Postman Problem (k-CPP): given a connected edge-weighted graph G and integers p and k, decide whether there are at least k closed walks such that every edge of G is contained in at least one of them and the total weight of the edges in the walks is at most p? The problem k-CPP is NP-complete, and van Bevern et al. (to appear) and Sorge (201...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2011
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-011-9428-9